On Furstenberg's Proof of the Infinitude of Primes
نویسنده
چکیده
1. C. B. Boyer, History of Analytic Geometry, Scripta Mathematica, New York, 1956. 2. J. L. Coolidge, The origin of analytic geometry, Osiris 1 (1936) 231–250, also available at www.jstor. org. 3. M. Ghomi and B. Solomon, Skew loops and quadric surfaces, Comment. Math. Helv. 4 (2002) 767–782. 4. J.-P. Sha and B. Solomon, No skew branes on non-degenerate hyperquadrics, Math. Zeit. 257 (2002) 225– 229. 5. S. Tabachnikov, On skew loops, skew branes, and quadratic hypersurfaces, Moscow Math. J. 3 (2003) 681–690.
منابع مشابه
Diagonal arguments and fixed points
A universal schema for diagonalization was popularized by N.S. Yanofsky (2003), based on a pioneering work of F.W. Lawvere (1969), in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema. Here, we fi...
متن کاملFrom Euclid to Present: A Collection of Proofs regarding the Infinitude of Primes
Prime numbers are considered the basic building blocks of the counting numbers, and thus a natural question is: Are there infinitely many primes? Around 300BC, Euclid demonstrated, with a proof by contradiction, that infinitely many prime numbers exist. Since his work, the development of various fields of mathematics has produced subsequent proofs of the infinitude of primes. Each new and uniqu...
متن کاملDirichlet’s Theorem on Primes in Arithmetic Sequences Math 129 Final Paper
Dirichlet’s theorem on primes in arithmetic sequences states that in any arithmetic progression m,m + k, m + 2k, m + 3k, . . ., there are infinitely many primes, provided that (m, k) = 1. Euler first conjectured a result of this form, claiming that every arithmetic progression beginning with 1 contained an infinitude of primes. The theorem as stated was conjectured by Gauss, and proved by Diric...
متن کاملFormalization of the prime number theorem and Dirichlet's theorem
We present the formalization of Dirichlet’s theorem on the infinitude of primes in arithmetic progressions, and Selberg’s elementary proof of the prime number theorem, which asserts that the number π(x) of primes less than x is asymptotic to x/ log x, within the proof system Metamath.
متن کاملPrime Numbers in Certain Arithmetic Progressions
We discuss to what extent Euclid’s elementary proof of the infinitude of primes can be modified so as to show infinitude of primes in arithmetic progressions (Dirichlet’s theorem). Murty had shown earlier that such proofs can exist if and only if the residue class (mod k ) has order 1 or 2. After reviewing this work, we consider generalizations of this question to algebraic number fields.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- The American Mathematical Monthly
دوره 116 شماره
صفحات -
تاریخ انتشار 2009